Unjuk Kerja Selection Sort Hybrid

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enhanced Bidirectional Selection Sort

An algorithm is a well-defined procedure that takes some input in the form of some values, processes them and gives the desired output. It forms the basis of many other algorithms such as searching, pattern matching, digital filters etc., and other applications have been found in database systems, data statistics and processing, data communications and pattern matching. This paper introduces al...

متن کامل

Hybrid Parallel Sort on the Cell Processor

Sorting large data sets has always been an important application, and hence has been one of the benchmark applications on new parallel architectures. We present a parallel sorting algorithm for the Cell processor that combines elements of bitonic sort and merge sort, and reduces the bandwidth to main memory by pipelining. We present runtime results of a partial prototype implementation and simu...

متن کامل

Optimizing Sort in Hadoop Using Replacement Selection

This paper presents and evaluates an alternative sorting component for Hadoop based on the replacement selection algorithm. In comparison with the default quicksort-based implementation, replacement selection generates runs which are in average twice as large. This makes the merge phase more efficient, since the amount of data that can be merged in one pass increases in average by a factor of t...

متن کامل

Pattern Recognition of the Selection Sort Algorithm

The field of program understanding attempts to determine the function of a code segment without programmer intervention and for this to occur, it is necessary to have a model (plan) against which to attempt to match the code segment of interest. This paper traces in detail the pattern recognition of the selection sort algorithm.

متن کامل

Sort-Merge Feature Selection for Video Data

Applying existing feature selection algorithms to video classification is impractical. A novel algorithm called Basic Sort-Merge Tree (BSMT) is proposed to choose a very small subset of features for video classification in linear time in the number of features. We reduce the cardinality of the input data by sorting the individual features by their effectiveness in categorization, and then mergi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Jurnal Buana Informatika

سال: 2020

ISSN: 2089-7642,2087-2534

DOI: 10.24002/jbi.v11i1.2699